Nonstandard arithmetic and recursive comprehension
نویسنده
چکیده
First order reasoning about hyperintegers can prove things about sets of integers. In the author’s paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic Logic 12 (2006), it was shown that each of the “big five” theories in reverse mathematics, including the base theory RCA0, has a natural nonstandard counterpart. But the counterpart RCA0 of RCA0 has a defect: it does not imply the Standard Part Principle that a set exists if and only if it is coded by a hyperinteger. In this paper we find another nonstandard counterpart, RCA0 , that does imply the Standard Part Principle.
منابع مشابه
Weak Theories of Nonstandard Arithmetic and Analysis
A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomial-time computable arithmetic. A means of formalizing basic real analysis in such theories is sketched. §
متن کاملAn Effective Conservation Result for Nonstandard Arithmetic
We prove that a nonstandard extension of arithmetic is eeectively conservative over Peano arithmetic by using an internal version of a deenable ultrapower. By the same method we show that a certain extension of the nonstandard theory with a saturation principle has the same proof-theoretic strength as second order arithmetic, where comprehension is restricted to arithmetical formulas.
متن کاملTransfer principles in nonstandard intuitionistic arithmetic
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modification of this construction then assigns a nonstandard model to any theory of arithmetic, enabling us to reproduce conservation results of Moerdijk and Palmgren for nonstandard Heyting arithmetic. Internalizing the constr...
متن کاملFinite Models of Eleimentaxy Recursive Nonstandard Analysis
This paper provides a new proof of the consistency of the formal system presented by Chuaqui and Suppes in [2, 9). First, a simpler, yet stronger, system, called Elementary Recursive Nonstandard Analysis, ERNA, will be provided. Indeed, it will be shown that ERNA proves all of the theorems of the Chuaqui and Suppes system. Then a finitary consistency proof of ERNA dl be given; in particular, we...
متن کاملFinite Models of Elementary Recursive Nonstandard Analysis
This paper provides a new proof of the consistency of a formal system similar to the one presented by Chuaqui and Suppes in 2, 9]. First, a simpler, yet in some respects stronger, system, called Elementary Re-cursive Nonstandard Analysis (ERNA) will be provided. Indeed, it will be shown that ERNA proves the main axioms of the Chuaqui and Sup-pes system. Then a nitary consistency proof of ERNA w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 161 شماره
صفحات -
تاریخ انتشار 2010